The infinite limit of separable permutations
نویسندگان
چکیده
Let denote the uniform probability measure on set of separable permutations in Sn. with an appropriate metric and by compact space consisting functions from to which are injections when restricted ; that is, if , i ≠ j, then . Extending defining for j > n, we have We show converges weakly a limiting distribution regenerative type, calculate explicitly.
منابع مشابه
The Brownian Limit of Separable Permutations
Context of our work. Describing typical properties of permutations in a given class is a question that has received quite a lot of attention in the last few years. Most of the attention is focused on permutation classes Av(τ) for τ of size 3. See for instance the very precise description of the asymptotic shape of permutations in these classes by Miner and Pak [12], or the link between large ra...
متن کاملSubclasses of the Separable Permutations
The separable permutations are those that can be obtained from the trivial permutation by two operations called direct sum and skew sum. This class of permutations contains the class of stack sortable permutations,Avp231q, which are enumerated by the Catalan numbers. We prove that all subclasses of the separable permutations which do not contain Avp231q or a symmetry of this class have rational...
متن کاملUnsplittable Classes of Separable Permutations
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
متن کاملInfinite permutations vs. infinite words
I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. [4] permutations appear in a very similar framework as early as in 1977. I am going to tell about periodicity of permutations, their complexity accor...
متن کاملEquipopularity Classes in the Separable Permutations
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length n patterns in the separable permutations is equal to the number of partitions of the integer n− 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2021
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21014